Index Sets for Finite Normal Predicate Logic Programs with Function Symbols
نویسندگان
چکیده
We study the recognition problem in the metaprogramming of finite normal predicate logic programs. That is, let L be a computable first order predicate language with infinitely many constant symbols and infinitely many n-ary predicate symbols and n-ary function symbols for all n ≥ 1. Then we can effectively list all the finite normal predicate logic programs Q0, Q1, . . . over L. Given some property P of finite normal predicate logic programs over L, we define the index set IP to be the set of indices e such that Qe has property P. Then we shall classify the complexity of the index set IP within the arithmetic hierarchy for various natural properties of finite predicate logic programs.
منابع مشابه
Index sets for Finite Normal Predicate Logic Programs
Let L be a computable first order predicate language with infinitely many constant symbols and infinitely many n-ary predicate symbols and n-ary functions symbols for all n ≥ 1 and let Q0, Q1, . . . be an effective list all the finite normal predicate logic programs over L. Given some property P of finite normal predicate logic programs over L, we define the index set IP to be the set of indice...
متن کاملEffectively Reasoning about Infinite Sets in Answer Set Programming
In answer set programming (ASP), one does not allow the use of function symbols. Disallowing function symbols avoids the problem of having logic programs which have stable models of excessively high complexity. For example, Marek, Nerode, and Remmel showed that there exist finite predicate logic programs which have stable models but which have no hyperarithmetic stable model. Disallowing functi...
متن کاملOn Optimization of Monadic Logic Programs
The article is devoted to the optimization of monadic logic programs and goals (programs and goals, which do not use functional symbols of arity > 1 and use only predicate symbols of arity 1). A program P is terminating with respect to a goal G, if an SLD-tree of P and G is finite. In general, monadic programs are not terminating. Program and goal transformations are introduced, by which a mona...
متن کاملThe distribution semantics for normal programs with function symbols
The distribution semantics integrates logic programming and probability theory using a possible worlds approach. Its intuitiveness and simplicity has made it the most widely used semantics for probabilistic logic programming, with successful applications in many domains. When the program has function symbols, the semantics was defined for special cases: either the program has to be definite or ...
متن کاملPolynomially Bounded Logic Programs with Function Symbols: A New Decidable
A logic program with function symbols is called finitely ground if there is a finite propositional logic program whose stable models are exactly the same as the stable models of this program. Finite groundability is an important property for logic programs with function symbols because it makes feasible to compute such program’s stable models using traditional ASP solvers. In this paper, we int...
متن کامل